package org.hot100_1;

public class leetcode89 {
    public int longestCommonSubsequence(String text1, String text2) {

        int m = text1.length();
        int n = text2.length();
        //dp[i][j]表示text1的前i个（不包括第i个）字符和text2的前j个（不包括第j个）最长公共子序列
        int [][] dp =new int[m+1][n+1];

        for (int i = 1; i <=m; i++) {
            for (int j = 1; j <=n; j++) {
                if (text1.charAt(i-1)==text2.charAt(j-1)){
                    dp[i][j]=dp[i-1][j-1]+1;
                }else {
                    dp[i][j]=Math.max(dp[i-1][j],dp[i][j-1]);
                }
            }
        }

        return dp[m][n];
    }
}
